The Price of Anarchy

نویسنده

  • Sara Robinson
چکیده

Interstate 5 stretches through California’s San Joaquin valley, straight and flat as far as the eye can see, giving drivers a unique opportunity to observe game theory in action. With only two lanes in each direction, most cars stay in the left lane, zipping past the slow moving trucks, which keep to the right. Every so often, an impatient truck driver lumbers into the left lane, blockading the road for several long minutes as he edges ahead of his even more sluggish comrades. Meanwhile, a long line of cars quickly builds up. Eventually, car drivers start to swerve into the right lane, zooming past the line of cars, only to duck back in at the front of the line. Each time a car cuts back in line, the cars behind brake, slowing traffic further. Soon, the right lane is clogged with impatient car drivers trying to advance, which, in turn, induces more truck drivers to try to pass on the left. Although some of the scofflaw traffic does get to Los Angeles in less than the average travel time, the average time increases. In other words, the selfish behavior of some individuals increases the congestion of the highway. This “highway game” is reminiscent of the well-known Prisoner’s Dilemma from economic game theory. There, each of two arrested suspects is given the choice of confessing or remaining silent. Each suspect knows the rules: If both confess, both get light (five-year) sentences for the crime. If neither confesses, both get six-month sentences, on a minor charge. If one confesses while the other remains silent, the one who confesses walks free while the silent one gets the full (ten-year) sentence. These rules yield a strange paradox: Each player improves his own lot by confessing, regardless of what the other player does, yet the optimal outcome for the pair occurs when both suspects remain silent. An instance of the game in which both suspects make the selfish choice is an example of a Nash equilibrium, a set of strategies such that even if each player knows what the other player’s strategy is, he has no incentive to change his own. A Nash equilibrium is a simple model of what happens in a competitive market. From a global perspective, as these examples show, competition often has a cost. Still, for most markets, achieving the global optimum is not a reasonable expectation, either because there is not enough information to compute it or because centralized control is undesirable for other reasons. In such situations, the Nash equilibrium may be a reasonable approximation to the optimum, and the best that can be hoped for. But how good an approximation is it? Computer scientists have found an answer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Price of Stochastic Anarchy

We consider the solution concept of stochastic stability, and propose the price of stochastic anarchy as an alternative to the price of (Nash) anarchy for quantifying the cost of selfishness and lack of coordination in games. As a solution concept, the Nash equilibrium has disadvantages that the set of stochastically stable states of a game avoid: unlike Nash equilibria, stochastically stable s...

متن کامل

Local and global price of anarchy of graphical games

This paper initiates a study of connections between local and global properties of graphical games. Specifically, we introduce a concept of local price of anarchy that quantifies how well subsets of agents respond to their environments. We then show several methods of bounding the global price of anarchy of a game in terms of the local price of anarchy. All our bounds are essentially tight.

متن کامل

The Local and Global Price of Anarchy of Graphical Games

This paper initiates a study of connections between local and global properties of graphical games. Specifically, we introduce a concept of local price of anarchy that quantifies how well subsets of agents respond to their environments. We then show several methods of bounding the global price of anarchy of a game in terms of the local price of anarchy. All our bounds are essentially tight.

متن کامل

Design Trade-offs in Concave Cost Sharing Games

This paper focuses on the design of cost sharing rules to optimize the efficiency of the resulting equilibria in cost sharing games with concave cost functions. Our analysis focuses on two well-studied measures of efficiency, termed the price of anarchy and price of stability, which provide worstcase guarantees on the performance of the (worst or best) equilibria. Our first result characterizes...

متن کامل

Strong Price of Anarchy and Coalitional Dynamics

We introduce a framework for studying the effect of cooperation on the quality of outcomes in utility games. Our framework is a coalitional analog of the smoothness framework of noncooperative games. Coalitional smoothness implies bounds on the strong price of anarchy, the loss of quality of coalitionally stable outcomes, as well as bounds on coalitional versions of coarse correlated equilibria...

متن کامل

Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy

We consider the well-studied game-theoretic version of machine scheduling in which jobs correspond to self-interested users and machines correspond to resources. Here each user chooses a machine trying to minimize her own cost, and such selfish behavior typically results in some equilibrium which is not globally optimal : An equilibrium is an allocation where no user can reduce her own cost by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004